Chromatic index, treewidth and maximum degree
نویسندگان
چکیده
We conjecture that any graphG with treewidth k and maximum degree ∆(G) ≥ k + √ k satisfies χ′(G) = ∆(G). In support of the conjecture we prove its fractional version.
منابع مشابه
List edge-colouring and total colouring in graphs of low treewidth
We prove that the list chromatic index of a graph of maximum degree ∆ and treewidth ≤ √ 2∆ − 3 is ∆; and that the total chromatic number of a graph of maximum degree ∆ and treewidth ≤ ∆/3 + 1 is ∆ + 1. This improves results by Meeks and Scott.
متن کاملList Edge-Coloring and Total Coloring in Graphs of Low Treewidth
We prove that the list chromatic index of a graph of maximum degree and treewidth ≤ √2 − 3 is ; and that the total chromatic number of a graph of maximum degree and treewidth ≤ /3 + 1 is + 1. This improves results by Meeks and Scott. C © 2015 Wiley Periodicals, Inc. J. Graph Theory 81: 272–282, 2016
متن کاملA new approach to compute acyclic chromatic index of certain chemical structures
An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph $G$ denoted by $chi_a '(G)$ is the minimum number $k$ such that there is an acyclic edge coloring using $k$ colors. The maximum degree in $G$ denoted by $Delta(G)$, is the lower bound for $chi_a '(G)$. $P$-cuts introduced in this paper acts as a powerfu...
متن کاملForbidden Subgraph Colorings and the Oriented Chromatic Number
We present an improved upper bound of O(d 1 m−1 ) for the (2,F)-subgraph chromatic number χ2,F (G) of any graph G of maximum degree d. Here, m denotes the minimum number of edges in any member of F . This bound is tight up to a (log d) multiplicative factor and improves the previous bound presented in [1]. We also obtain a relationship connecting the oriented chromatic number χo(G) of graphs an...
متن کاملChromatic Harmonic Indices and Chromatic Harmonic Polynomials of Certain Graphs
In the main this paper introduces the concept of chromatic harmonic polynomials denoted, $H^chi(G,x)$ and chromatic harmonic indices denoted, $H^chi(G)$ of a graph $G$. The new concept is then applied to finding explicit formula for the minimum (maximum) chromatic harmonic polynomials and the minimum (maximum) chromatic harmonic index of certain graphs. It is also applied to split graphs and ce...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Notes in Discrete Mathematics
دوره 54 شماره
صفحات -
تاریخ انتشار 2016